The virtual company: a re-configurable open shell for problem-based learning in industrial engineering
نویسندگان
چکیده
The interactive multimedia e-learning system (IMELS) is an e-learning courseware for industrial engineering developed at the University of Hong Kong. The system adopts a problem-based learning approach to the teaching and learning through the delivery of realistic case problems using interactive multimedia technology over the World-Wide-Web. The main features of the system include a multimedia portfolio of industrial engineering, an electronic knowledge base and the virtual company suit that presents the case problem that exists in two virtual enterprises. As the system is designed to enhance the effectiveness of teaching industrial engineers who will become more capable individuals to fit into their future careers through the exposition of vivid case problems in their learning process, one of the main features of the system is its ability to create computer-based material for case problems in a flexible and efficient manner. In this respect, the open-shell architecture of the virtual company, which consists of a client-based interface that runs on user PCs and a server-based repository, enables web-based materials to be loaded and organized in real time so that the content of individual virtual companies can be dynamically configured to cater for each case problem. Apart from the introduction of the IMELS, this paper focuses on the design and the functionality of the virtual company. The unique feature of the configurable animated entities will be explained and is illustrated with a case problem that exists in the GX Port Holdings Corporation virtual company. q 2004 Elsevier Ltd. All rights reserved.
منابع مشابه
The trim loss concentration in one-dimensional cutting stock problem (1D-CSP) by defining a virtual cost
Nowadays, One-Dimensional Cutting Stock Problem (1D-CSP) is used in many industrial processes and re-cently has been considered as one of the most important research topic. In this paper, a metaheuristic algo-rithm based on the Simulated Annealing (SA) method is represented to minimize the trim loss and also to fo-cus the trim loss on the minimum number of large objects. In this method, the 1D-...
متن کاملA knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کاملA genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem
Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...
متن کاملVirtual Class Room Experimentation for Teaching Manufacturing and Operation Management Course
There has been a recent development and explosion of interest among academicians across a wide range of disciplines in the use of virtual Class room. Utilization of the virtual class room as a laboratory experimentation for teaching and learning has increased significantly in recent years as development tools for web based applications have become easier to use and computers have become more ca...
متن کاملAn electromagnetism-like metaheuristic for open-shop problems with no buffer
This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 47 شماره
صفحات -
تاریخ انتشار 2004